An Optimal Algorithm for Left-to-Right Signed-Binary Representation of Four Integers
نویسنده
چکیده
In elliptic curve cryptography, the problem of computing an integer k from two points on the ellipse namely kp, p the computation of ap+bq+cr+ds, is performed from Shamir’s method. In this paper an algorithm is proposed for computing the minimum joint weight for the integers a, b, c, d, examining them from left to right. Keywords—ECC protocol, JSF algorithm, joint weight, optimality, ISB representation, SB representation, SB bit.
منابع مشابه
On the Signed-Binary Window Method
We propose a left-to-right (i.e., from the most significant column to the least significant column) algorithm for computing a signed-binary (SB) representation of pairs of integers with minimum joint weight as well as maximum average length of zero-column runs. The proposed method speeds up the scalar multiplication of elliptic curve cryptosystems (ECC) by all known strategies, while at the sam...
متن کاملOptimal Signed-Binary Representation for Integers
The signed-binary (SB) number system uses digits 0, 1, and –1 to recode integers. The SB representation for integers is very useful in computations for elliptic curve cryptography, digital signatures, and batch verifications, all of which are popular security solutions in today’s communication industry. What is an optimal SB representation? How to find it? This article gives easy-to-understand ...
متن کاملSome Explicit Formulae of NAF and its Left-to-Right Analogue
Non-Adjacent Form (NAF) is a canonical form of signed binary representation of integers. We present some explicit formulae of NAF and its left-to-right analogue (FAN) for randomly chosen n-bit integers. Interestingly, we prove that the zero-run length appeared in FAN is asymptotically 16/7, which is longer than that of the standard NAF. We also apply the proposed formulae to the speed estimatio...
متن کاملSigned Binary Representations Revisited
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expense of some precomputation. In groups where inversion is easy (e.g. elliptic curves), signed representations of the exponent are meaningful because they decrease the amount of required precomputation. The asymptotic bes...
متن کاملOptimal Recloser Placement by Binary Differential Evolutionary Algorithm to Improve Reliability of Distribution System
In this context, a novel structure has been proposed for simple Differential Evolutionary (DE) algorithm to solve optimal recloser placement. For this, an operator is added to DE algorithm to adapt concept of the problem. Other contribution of this work is formulating a novel objective function. The proposed objective function has been formulated to improve four reliability indices which consis...
متن کامل